ON c - AND P - RECURSMLY ENUMERABLE DEGREES
نویسندگان
چکیده
Several problems in recursion theory on admissible o¡dinals (a -recursion theory) and recursion theory on inadmissible ordinals (B -recursion theory) are studied. Fruitful interactions betweenboth theories are stressed. In the fr¡stpart the admissible collapse is used in order to characterizefor some inadmissible B the structure of all p -recursively enumerable degrees asanaccumulationof structures of 2[-recursively enumerable degrees for many admissible structures 2[. Thus problems about the B -recursively enumerable degrees can be solved by considering "locally" the analogous problem in an admissible 2[ (where results of a -recursion theory apply). In the second part p -recursion theory is used as a tool in infinite injurypriority constructions for some particularly interesting c (e.g. ,1"). New effects canbeobserved since some structu¡e of the inadmissibleworld above O'isprojected into the a-recursivelyenumerable degrees byinvertingthejump. The gained understandingof thejump of a-recursively enumerable degrees makes it possible to solve some open problems.
منابع مشابه
Recursmly Tnivartant P-recurston Theory
'We int¡oduce recursively invariant p-recursion theory as a new approach towards recursion theory on an arbitrary limit ordinal É. We follow Friedman and Sacks and call a subset of BB-recursively enumerable if it is.Xr-definable over Lu. Since Friedman-Sacks'notion of a p-finite set is not invariant under p-recursive permutations of p we turn to a different notion. Under all possible invariant ...
متن کاملDegrees of monotone complexity
Levin and Schnorr (independently) introduced the monotone complexity, Km(α), of a binary string α. We use monotone complexity to define the relative complexity (or relative randomness) of reals. We define a partial ordering ≤Km on 2 by α ≤Km β iff there is a constant c such that Km(α n) ≤ Km(β n) + c for all n. The monotone degree of α is the set of all β such that α ≤Km β and β ≤Km α. We show ...
متن کاملEmbedding the Diamond Lattice in the Recursively Enumerable Truth-table Degrees
It is shown that the four element Boolean algebra can be embedded in the recursively enumerable truth-table degrees with least and greatest elements preserved. Corresponding results for other lattices and other reducibilites are also discussed. For sets A, B ç co, we say that A is a truth-table (tt) reducible to B if there exists an effective procedure for reducing any question of the form "m e...
متن کاملDynamic Properties of Computably Enumerable
A set A ! is computably enumerable (c.e.), also called recursively enumerable, (r.e.), or simply enumerable, if there is a computable algorithm to list its members. Let E denote the structure of the c.e. sets under inclusion. Starting with Post 1944] there has been much interest in relating the deenable (especially E-deenable) properties of a c.e. set A to its information contentt, namely its T...
متن کاملWeak Density and Cupping in the D-r.e. Degrees
Consider the Turing degrees of di erences of recursively enumerable sets (the d-r.e. degrees). We show that there is a properly d-r.e. degree (a d-r.e. degree that is not r.e.) between any two comparable r.e. degrees, and that given a high r.e. degree h, every nonrecursive d-r.e. degree h cups to h by a low d-r.e. degree. A set A ! is called d-r.e. if there are recursively enumerable (r.e.) set...
متن کامل